Totally Unimodular Multistage Stochastic Programs

Abstract We consider totally unimodular multistage stochastic programs, that is, multistage stochastic programs whose extensive-form constraint matrices are totally unimodular. We establish several sufficient conditions and identify examples that have arisen in the literature

An Algorithm for the Job Shop Scheduling Problem based on Global Equilibrium Search Techniques

Job shop scheduling problem, Makespan, Global equilibrium search, Metaheuristics, 90B35,

Solving job shop scheduling problems utilizing the properties of backbone and “big valley”

Job shop scheduling problem, Makespan, Backbone, Big valley, Metaheuristic,